An effective hybrid search algorithm for the multiple traveling repairman problem with profits

The multiple traveling repairman problem with profits consists of repairmen serving a subset all customers to maximize the revenues collected through visited customers. To address this problem, an effective hybrid search algorithm based on memetic framework is proposed. In proposed method, three features are integrated: dedicated arc-based crossover generate high-quality offspring solutions, fast evaluation technique reduce complexity navigating classical neighborhoods as well correcting step ensure accurate neighboring solutions. performance 470 benchmark instances were compared those leading reference algorithms. results show that outperforms state-of-the-art algorithms by setting new records for 137 and matching best-known 330 instances. importance key components was investigated.